Turing and the development of computational complexity
نویسندگان
چکیده
Turing’s beautiful capture of the concept of computability by the “Turing machine” linked computability to a device with explicit steps of operations and use of resources. This invention led in a most natural way to build the foundations for computational complexity.
منابع مشابه
Some improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملBayesian perspective over time
Thomas Bayes, the founder of Bayesian vision, entered the University of Edinburgh in 1719 to study logic and theology. Returning in 1722, he worked with his father in a small church. He also was a mathematician and in 1740 he made a novel discovery which he never published, but his friend Richard Price found it in his notes after his death in 1761, reedited it and published it. But until L...
متن کاملUna Presentacion Uniforme De La Teoria Descriptiva De La Complejidad Computacional
The Theory of Descriptive Computational Complexity deals with Computational Complexity from the perspective of Logic. Among its main goals it is the logical characterization of computational complexity classes, traditionally defined in terms of resource bounded Turing machines. The presentation often found of this theory in the current literature, follows its historical development; hence, in c...
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملRemarks on the computational complexity of small universal Turing machines
This paper surveys some topics in the area of small universal Turing machines and tag systems. In particular we focus on recent results concerning the computational complexity of such machines.
متن کامل